Search results for "Network traffic control"
showing 9 items of 9 documents
Towards a SDN-based architecture for analyzing network traffic in cloud computing infrastructures
2015
Currently, network traffic monitoring tools do not fit well in the monitoring of cloud computing infrastructures. These tools are not integrated with the control plane of the cloud computing stack. This lack of integration causes a deficiency in the handling of the re-usage of IP addresses along virtual machines, a lack of adaption and reaction on highly frequent topology changes, and a lack of accuracy in the metrics gathered for the networking traffic flowing along the cloud infrastructure. The main contribution of this paper is to provide a novel SDN-based architecture to carry out the monitoring of network traffic in cloud infrastructures. The architecture in based on the integration be…
Attracting sets in network regulatory theory
2016
Modern telecommunication networks are very complex and they should be able to deal with rapid and unpredictable changes in traffic flows. Virtual Network Topology is used to carry IP traffic over Wavelength-division multiplexing optical network. To use network resources in the most optimal way, there is a need for an algorithm, which will dynamically re-share resources among all devices in the particular network segment, based on links utilization between routers. Attractor selection mechanism could be used to dynamically control such Virtual Network Topology. The advantage of this algorithm is that it can adopt to very rapid, unknown and unpredictable changes in traffic flows. This mechani…
VEF Traces: A Framework for Modelling MPI Traffic in Interconnection Network Simulators
2015
Simulation is often used to evaluate the behaviour and measure the performance of computing systems. Specifically, in high-performance interconnection networks, the simulation has been extensively considered to verify the behaviour of the network itself and to evaluate its performance. In this context, network simulation must be fed with network traffic, also referred to as network workload, whose nature has been traditionally synthetic. These workloads can be used for the purpose of driving studies on network performance, but often such workloads are not accurate enough if a realistic evaluation is pursued. For this reason, other non-synthetic workloads have gained popularity over last dec…
Performance evaluation of a measurement-based algorithm for distributed admission control in a DiffServ framework
2002
Distributed Admission Control in IP DiffServ environments is an emerging and promising research area. Distributed admission control solutions share the idea that no coordination among network routers (i.e. explicit signaling) is necessary, when the decision whether to admit or reject a new offered flow is pushed to the edge of the IP network. Proposed solutions differ in the degree of complexity required in internal network routers, and result in a different robustness and effectiveness in controlling the accepted traffic. This paper builds on a recently proposed distributed admission control solution, called GRIP (Gauge&Gate Reservation with Independent Probing), designed to integrate the …
On the development of a communication-aware task mapping technique
2004
Clusters have become a very cost-effective platform for high-performance computing. In these systems, although currently existing networks actually provide enough bandwidth for the existing applications and workstations, the trend is towards the interconnection network becoming the system bottleneck. Therefore, in the future, scheduling strategies will have to take into account the communication requirements of the applications and the communication bandwidth that the network can offer. One of the key issues in these strategies is the task mapping technique used when the network becomes the system bottleneck.In this paper, we propose a communication-aware mapping technique that tries to mat…
Active queue management stability in multiple bottleneck networks
2004
In this paper, we show that the active queue management (AQM) controllers, usually configured on a single bottleneck basis, may not prevent instability in the presence of multiple bottlenecks. We justify this result through a multiple bottleneck model.
Congestion Avoidance Using DYnamic COdec MAnagement: A solution for ISP
2005
The large diffusion of VoIP is an essential key for the success of emerging Internet service providers. These ISPs conflict with the interests of historical and predominant network maintainers which often control the network infrastructure and telephone services. To win this competition, emerging ISPs have to adopt strategic QoS solutions which will capture the attention of network users and phone clients. This paper presents a solution which is able to obtain the same performance of a 64 Kbps channel reducing the costs for over-provisioning network bandwidth. DyCoMa is a mechanism studied for VoIP applications in network with a limited bandwidth for multimedia services. It works preventing…
End-to-end congestion control protocols for remote programming of robots, using heterogeneous networks: A comparative analysis
2008
There are many interesting aspects of Internet Telerobotics within the network robotics context, such as variable bandwidth and time-delays. Some of these aspects have been treated in the literature from the control point of view. Moreover, only a little work is related to the way Internet protocols can help to minimize the effect of delay and bandwidth fluctuation on network robotics. In this paper, we present the capabilities of TCP, UDP, TCP Las Vegas, TEAR, and Trinomial protocols, when performing a remote experiment within a network robotics application, the UJI Industrial Telelaboratory. Comparative analysis is presented through simulations within the NS2 platform. Results show how th…
A New Scalable and Cost-Effective Congestion Management Strategy for Lossless Multistage Interconnection Networks
2005
In this paper, we propose a new congestion management strategy for lossless multistage interconnection networks that scales as network size and/or link bandwidth increase. Instead of eliminating congestion, our strategy avoids performance degradation beyond the saturation point by eliminating the HOL blocking produced by congestion trees. This is achieved in a scalable manner by using separate queues for congested flows. These are dynamically allocated only when congestion arises, and deallocated when congestion subsides. Performance evaluation results show that our strategy responds to congestion immediately and completely eliminates the performance degradation produced by HOL blocking whi…